Non-blocking Algorithm for Eventual Consistent Replicated Database on Cloud

One of the challenges of cloud programming is to achieve the right balance between availability and consistency in a distributed database. Cloud computing environments, particularly cloud databases, are rapidly increasing in importance, acceptance and usage in major applications, which need the partition-tolerance and availability for scalability purposes, thus sacrificing the consistency side (CAP theorem). With this approach, use of paradigms such as eventual consistency became more widespread. In these environments, a large number of user’s access data stored in highly available storage systems. In this research we use eventually consistent transactions with revision diagrams for visibility and arbitration to manage updates in replicates. We present a new non-blocking algorithm to implement eventual consistency using revision diagrams and fork-join data in a distributed environment. Finally, we show that the proposed method solves the problem.